Reordering an existing queue
نویسندگان
چکیده
We investigate the problem of reordering agents starting from an existing queue. First, we introduce four important axioms of the problem, budget balance (BB), outcome efficiency (OE), strategyproofness (SP), and individual rationality (IR). Unfortunately, it is easy to show that these four axioms are incompatible in the current setup. Given this negative result, we examine the consequences of relaxing BB, OE and SP, one at a time. Our results are as follows: (i) There is no mechanism satisfying OE, SP and IR which runs a nonnegative surplus at all profiles. (ii) When there are two agents, the only non-trivial mechanisms satisfying BB, SP and IR are fixed price trading mechanisms but there are additional mechanisms when there are more than two agents. We identify an intuitive mechanism which we call the median price exchange mechanism and characterize its maximal level of inefficiency. (iii) By weakening SP to ‘one-sided’ strategyproofness, we identify two mechanisms, the buyers’ mechanism and the sellers’ mechanism, and characterize them on the basis of independence axioms. JEL Classifications: C72, D63, D82.
منابع مشابه
When queueing is better than push and shove
We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that existing property rights for the service are small enough to enable trade between the agents. In particul...
متن کاملModeling a QoS classified communication environment with packet reordering feature
Queueing models are widely used to establish stochastic models for QoS analysis of different communication environments. In [1] the authors created a queueing model to evaluate a sensor network environment with two quality classes of sources. The “Emergency” class represents the sources of very important communication (e.g. fire alarm), and the “Normal” class represents the standard communicati...
متن کاملDynamic Issues in MPLS Service Restoration
The rapid growth of real-time and high-priority traffic over IP networks makes network survivability more critical. Several MPLS-based recovery mechanisms have been proposed to ensure continuity of service following network impairments. These approaches, however, suffer from the transient effects that negatively impact the traffic that is being rerouted onto the protection paths. Packet loss an...
متن کاملStationary Characteristics Of Homogenous Geo/Geo/2 Queue With Resequencing In Discrete Time
Resequencing problem is a crucial issue in communication systems, databases, production and information networks because correct processing of information by them may often be performed only if original order of packets, queries, jobs is preserved. In this paper consideration is given to one of the queueing systems that may model processes of discrete nature where resequencing phenomenon may ar...
متن کاملMaximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)
This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 49 شماره
صفحات -
تاریخ انتشار 2017